On Imprimitive Linear Homogeneous Groups
نویسندگان
چکیده
منابع مشابه
Finite imprimitive linear groups of prime degree
In an earlier paper the authors have classified the nonsolvable primitive linear groups of prime degree over C. The present paper deals with the classification of the nonsolvable imprimitive linear groups of prime degree (equivalently, the irreducible monomial groups of prime degree). If G is a monomial group of prime degree r, then there is a projection π of G onto a transitive group H of perm...
متن کاملOn the Order of Linear Homogeneous Groups
1. In the writer's theorems f on finite groups of linear homogeneous substitutions of determinant unity, a group of special nature called a self conjugate (or invariant) subgroup H plays an important rôle. There is a lack of completeness to these theorems due to the fact it has not been proved that H is actually less than the transitive (irreducible) group G in which, under certain conditions, ...
متن کاملImprimitive Permutation Groups
The O’Nan-Scott Theorem together with the Classification of the Finite Simple Groups is a powerful tool that give the structure of all primitive permutation groups, as well as their actions. This has allowed for the solution to many classical problems, and has opened the door to a deeper understanding of imprimitive permutation groups, as primitive permutation groups are the building blocks of ...
متن کاملOn imprimitive rank 3 permutation groups
A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor, Liebler, Liebeck and Saxl, this yields a classification of all quasiprimitive rank 3 permutation groups. Our classification is achieved by first classifying imprimi...
متن کاملImprimitive Homogeneous Simple 3 - graphs , part 1
We prove that there is only one imprimitive homogeneous simple unstable 3-graph with finite classes such that all predicates are realised in the union of two classes. 1 Definitions and context. Definition 1.1. An n-graph is a structure (M,R1, . . . , Rn) in which each Ri is binary, irreflexive and symmetric; also, for all distinct x, y ∈ M exactly one of the Ri holds and n ≥ 2. We assume that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1905
ISSN: 0002-9947
DOI: 10.2307/1986301